2-additive Choquet Optimal Solutions in Multiobjective Optimization Problems
نویسندگان
چکیده
In this paper, we propose a sufficient condition for a solution to be optimal for a 2-additive Choquet integral in the context of multiobjective combinatorial optimization problems. A 2-additive Choquet optimal solution is a solution that optimizes at least one set of parameters of the 2-additive Choquet integral. We also present a method to generate 2-additive Choquet optimal solutions of multiobjective combinatorial optimization problems. The method is experimented on some Pareto fronts and the results are analyzed.
منابع مشابه
Dominance Rules for the Choquet Integral in Multiobjective Dynamic Programming
Multiobjective Dynamic Programming (MODP) is a general problem solving method used to determine the set of Pareto-optimal solutions in optimization problems involving discrete decision variables and multiple objectives. It applies to combinatorial problems in which Pareto-optimality of a solution extends to all its sub-solutions (Bellman principle). In this paper we focus on the determination o...
متن کاملChoquet-based optimisation in multiobjective shortest path and spanning tree problems
This paper is devoted to the search of Choquet-optimal solutions in finite graph problems with multiple objectives. The Choquet integral is one of the most sophisticated preference models used in decision theory for aggregating preferences on multiple objectives. We first present a condition on preferences (name hereafter preference for interior points) that characterizes preferences favouring ...
متن کاملCombining Preference Elicitation and Search in Multiobjective State-Space Graphs
The aim of this paper is to propose a new approach interweaving preference elicitation and search to solve multiobjective optimization problems. We present an interactive search procedure directed by an aggregation function, possibly non-linear (e.g. an additive disutility function, a Choquet integral), defining the overall cost of solutions. This function is parameterized by weights that are i...
متن کاملChoquet optimal set in biobjective combinatorial optimization
We study in this paper the generation of the Choquet optimal solutions of biobjective combinatorial optimization problems. Choquet optimal solutions are solutions that optimize a Choquet integral. The Choquet integral is used as an aggregation function, presenting di erent parameters, and allowing to take into account the interactions between the objectives. We develop a new property that chara...
متن کاملA Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems
This paper is devoted to the search for Choquet-optimal solutions in multicriteria combinatorial optimization with application to spanning tree problems and knapsack problems. After recalling basic notions concerning the use of Choquet integrals for preference aggregation, we present a condition (named preference for interior points) that characterizes preferences favouring well-balanced soluti...
متن کامل